Enter a word or phrase in any language 👆
Language:
Translation and analysis of words by ChatGPT artificial intelligence
On this page you can get a detailed analysis of a word or phrase, produced by the best artificial intelligence technology to date:
- how the word is used
- frequency of use
- it is used more often in oral or written speech
- word translation options
- usage examples (several phrases with translation)
- etymology
anaxiomatization heuristic technique - translation to russian
HEURISTIC THAT NEVER OVERESTIMATES THE COST OF REACHING THE GOAL, I.E. THE COST IT ESTIMATES TO REACH THE GOAL IS NOT HIGHER THAN THE LOWEST POSSIBLE COST FROM THE CURRENT POINT IN THE PATH
Admissible Heuristic; Optimistic heuristic; Inadmissible heuristic
anaxiomatization heuristic technique
эвристический метод анаксиоматизации (решения задач)
heuristic
PROBLEM-SOLVING METHOD THAT IS SUFFICIENT FOR QUICK, SHORT-TERM SOLUTIONS/APPROXIMATIONS
Heuristics; Hueristic; Heuristo; HEURISTIC; Heurisitc; Heuristically; Huristic; Heuristic Classification; Heuristics in legal decision-making; Formal models of heuristics; Heuristic device; Artificial intelligence heuristics
heuristic device
PROBLEM-SOLVING METHOD THAT IS SUFFICIENT FOR QUICK, SHORT-TERM SOLUTIONS/APPROXIMATIONS
Heuristics; Hueristic; Heuristo; HEURISTIC; Heurisitc; Heuristically; Huristic; Heuristic Classification; Heuristics in legal decision-making; Formal models of heuristics; Heuristic device; Artificial intelligence heuristics
эвристическое средство; по М. Веберу - эвристическое средство есть своего рода идеальный тип, позволяющий анализировать конкретный исторический случай.
Wikipedia
Admissible heuristic
In computer science, specifically in algorithms related to pathfinding, a heuristic function is said to be admissible if it never overestimates the cost of reaching the goal, i.e. the cost it estimates to reach the goal is not higher than the lowest possible cost from the current point in the path.
It is related to the concept of consistent heuristics. While all consistent heuristics are admissible, not all admissible heuristics are consistent.
